Goto

Collaborating Authors

 empirical experimentation


Uncertainty in Automated Ontology Matching: Lessons Learned from an Empirical Experimentation

Osman, Inès, Pileggi, Salvatore F., Yahia, Sadok Ben

arXiv.org Artificial Intelligence

Data integration is considered a classic research field and a pressing need within the information science community. Ontologies play a critical role in such a process by providing well-consolidated support to link and semantically integrate datasets via interoperability. This paper approaches data integration from an application perspective, looking at techniques based on ontology matching. An ontology-based process may only be considered adequate by assuming manual matching of different sources of information. However, since the approach becomes unrealistic once the system scales up, automation of the matching process becomes a compelling need. Therefore, we have conducted experiments on actual data with the support of existing tools for automatic ontology matching from the scientific community. Even considering a relatively simple case study (i.e., the spatio-temporal alignment of global indicators), outcomes clearly show significant uncertainty resulting from errors and inaccuracies along the automated matching process. More concretely, this paper aims to test on real-world data a bottom-up knowledge-building approach, discuss the lessons learned from the experimental results of the case study, and draw conclusions about uncertainty and uncertainty management in an automated ontology matching process. While the most common evaluation metrics clearly demonstrate the unreliability of fully automated matching solutions, properly designed semi-supervised approaches seem to be mature for a more generalized application.


A System for Empirical Experimentation with Expert Knowledge

AI Classics

Specialization and generalization are accomplished by adding or deleting elements in these lists. The use of symbolic categories of belief (definite, probable, and possible) provides a specifiable means for manipulating the rules. While based on a simple idea, the SEEK program convincingly demonstrates the value of a rich('v structured representation and of reasoning from cases as a way of constructing a model. That is, exjJert knowledge is inseparable from case experience (Schank, 1983), in so far as knov.Jledge explains the cases. The use of a knowledge base to provide an explanatm), model has characterized other recent AIM work as well (cf.